tree automaton造句

例句与造句

1. Description : The paper presented the tree automaton, an extension of the correctness of programs.
2. For a different notion of tree automaton, closely related to regular tree languages, see branching automaton.
3. A set of ground terms is "'recognizable "'if there exists a tree automaton that accepts it.
4. It has been further observed that tree automaton and logical theories are closely connected and it allows decision problems in logic to be reduced into decision problems for automata.
5. Since there are no other initial states than to start an automaton run with, the term " ( ( ) ) " is not accepted by the tree automaton.
6. It's difficult to find tree automaton in a sentence. 用tree automaton造句挺难的
7. In automata theory, an "'alternating tree automaton "'is an extension of nondeterministic tree automaton as same as alternating finite automaton extends nondeterministic finite automaton ( NFA ).
8. In automata theory, an "'alternating tree automaton "'is an extension of nondeterministic tree automaton as same as alternating finite automaton extends nondeterministic finite automaton ( NFA ).
9. In contrast, "'deterministic "'top-down tree automata are less powerful than their bottom-up counterparts, because in a deterministic tree automaton no two transition rules have the same left-hand side.
10. Moreover, for Halin graphs ( a special case of treewidth three graphs ) counting is not needed : for these graphs, every property that can be recognized by a tree automaton can also be defined in monadic second-order logic.
11. Infinite tree automaton is " deterministic " if for some q \ in Q, \ sigma \ in \ Sigma, and d \ in D transition relation \ delta ( q, \ sigma, d ) has exactly one element.
12. Consequently a deterministic top-down tree automaton will only be able to test for tree properties that are true in all branches, because the choice of the state to write into each child branch is determined at the parent node, without knowing the child branches contents.
13. But, B點hi accepting condition is strictly weaker than other accepting conditions, i . e ., there exists a tree language which can be recognized by Muller accepting condition in infinite tree automata but can't be recognized by any B點hi accepting condition in some infinite tree automaton.